Electing a leader is a classical problem in distributed computing system.Synchronization between processes often requires one process acting as acoordinator. If an elected leader node fails, the other nodes of the systemneed to elect another leader without much wasting of time. The bully algorithmis a classical approach for electing a leader in a synchronous distributedcomputing system, which is used to determine the process with highest prioritynumber as the coordinator. In this paper, we have discussed the limitations ofBully algorithm and proposed a simple and efficient method for the Bullyalgorithm which reduces the number of messages during the election. Ouranalytical simulation shows that, our proposed algorithm is more efficient thanthe Bully algorithm with fewer messages passing and fewer stages.
展开▼
